#include <iostream>
using namespace std;

/*
        6
    1   2   3
       1   1
该树，自下而上即为set(6)的每个元素{126,136,16,26,36,6}
因此，set(n)的数量，等于以1——n/2为根的树节点数之和
*/

int Set(int n)
{
    int count = 1;
    for (int i = 1; i < n / 2 + 1; i++)
        count += Set(i);
    return count;
}

int main()
{
    int n;
    cin >> n;
    cout << "Set(" << n << ")=" << Set(n) << endl;
    return 0;
}